منابع مشابه
Almost Covers Of 2-Arc Transitive Graphs
Let Γ be a G-symmetric graph whose vertex set admits a nontrivial G-invariant partition B with block size v. Let ΓB be the quotient graph of Γ relative to B and Γ [B,C] the bipartite subgraph of Γ induced by adjacent blocks B,C of B. In this paper we study such graphs for which ΓB is connected, (G,2)-arc transitive and is almost covered by Γ in the sense that Γ [B,C] is a matching of v−1≥2 edge...
متن کاملArc-transitive abelian regular covers of cubic graphs
Quite a lot of attention has been paid recently to the construction of edgeor arc-transitive covers of symmetric graphs. In most cases, the approach has involved voltage graph techniques, which are excellent for finding regular covers in which the group of covering transformations is either cyclic or elementary abelian, or more generally, homocyclic, but are not so easy to use when the covering...
متن کاملArc-Transitive Dihedral Regular Covers of Cubic Graphs
A regular covering projection is called dihedral or abelian if the covering transformation group is dihedral or abelian. A lot of work has been done with regard to the classification of arc-transitive abelian (or elementary abelian, or cyclic) covers of symmetric graphs. In this paper, we investigate arc-transitive dihedral regular covers of symmetric (arc-transitive) cubic graphs. In particula...
متن کاملLocally 3-Arc-Transitive Regular Covers of Complete Bipartite Graphs
In this paper, locally 3-arc-transitive regular covers of complete bipartite graphs are studied, and results are obtained that apply to arbitrary covering transformation groups. In particular, methods are obtained for classifying the locally 3-arctransitive graphs with a prescribed covering transformation group, and these results are applied to classify the locally 3-arc-transitive regular cove...
متن کاملCountable locally 2-arc-transitive bipartite graphs
We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We give several new families of previously unknown countably infinite locally-2-arc-transitive graphs, each family containing continuum many members. These exampl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2007
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-007-2369-3